Importance Sampling via Load-Balanced Facility Location

نویسندگان

  • Aaron Archer
  • Shankar Krishnan
چکیده

In this paper, we consider the problem of “importance sampling” from a high dynamic range image motivated by a computer graphics problem called image-based lighting. Image-based lighting is a method to light a scene by using real-world images as part of a 3D environment. Intuitively, the sampling problem reduces to finding representative points from the image such that they are in higher density in regions of high intensity (or energy) and low density in regions of low intensity (or energy). We formulate this task as a facility location problem where the facility costs are a function of the demand served. In particular, we aim to encourage load balance amongst the facilities by using V-shaped facility costs that achieve a minimum at the “ideal” level of demand. We call this the load-balanced facility location problem, and it is a generalization of the uncapacitated facility location problem with uniform facility costs. We develop a primal-dual constant-factor approximation algorithm for this problem, and analyze its approximation ratio using dual fitting and factor-revealing linear programs. We also give some experimental results from applying our algorithm to instances derived from real high dynamic range images. ∗AT&T Labs – Research, 180 Park Avenue, Florham Park, NJ 07932. Email: {aarcher,krishnas}@research.att.com

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Placement and Network Design Problems

In this paper, we give the rst constant-approximations for a number of layered network design problems. We begin by modeling hierarchical caching, where caches are placed in layers and each layer satis es a xed percentage of the demand (bounded miss rates). We present a constant approximation to the minimum total cost of placing the caches and routing demand through the layers. We extend this m...

متن کامل

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

متن کامل

Connected facility location via random facility sampling and core detouring

Article history: Received 16 April 2009 Received in revised form 29 January 2010 Available online 18 February 2010

متن کامل

Balanced Overlay Networks (BON): Decentralized Load Balancing via Self-Organized Random Networks

We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node’s available computational resources in the structure of the links connecting the nodes in the network. This distributed encoding is self-...

متن کامل

A Constant Factor Approximation for the Single Sink Edge Installation Problem

We present the first constant approximation to the single sink buy-at-bulk network design problem, where we have to design a network by buying pipes of different costs and capacities per unit length to route demands at a set of sources to a single sink. The distances in the underlying network form a metric. This result improves the previous bound of O(log |R|), where R is the set of sources. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008